Path-based supports for hypergraphs
نویسندگان
چکیده
منابع مشابه
Path-Based Supports for Hypergraphs
5 A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-hard to determine a path-based support with the minimum number of edges or to decide whether there is a planar path-based support, we show that a path-based tree support can be computed in polynomial time if it exists.
متن کاملOn Planar Supports for Hypergraphs
A graph G is a support for a hypergraph H = (V,S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is connected. G is a planar support if it is a support and planar. Johnson and Pollak [11] proved that it is NPcomplete to decide if a given hypergraph has a planar support. In contrast, there are lienar time algorithms to tes...
متن کاملMinimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams
In this paper we present an O(n(m + logn))-time algorithm for computing a minimum-weight tree support (if one exists) of a hypergraph H = (V, S) with n vertices and m hyperedges. This improves the previously best known algorithm with running time O(nm). A support of H is a graph G on V such that each hyperedge in S induces a connected subgraph in G. If G is a tree, it is called a tree support a...
متن کاملThe Shortest Path Algorithms of Hypergraphs Based on Search Strategies
In order to search the shortest path from hypergraphs with unweighted hyperedges, a kind of searching algorithm based on the width-first strategy is presented at first. For hypergraphs with weighted hyperedges, a kind of searching algorithm based on the minimum-cost-first strategy to search the shortest path is presented. In order to enhance the reliability of the two algorithms, their correctn...
متن کاملMonochromatic Path and Cycle Partitions in Hypergraphs
Here we address the problem to partition edge colored hypergraphs by monochromatic paths and cycles generalizing a well-known similar problem for graphs. We show that r-colored r-uniform complete hypergraphs can be partitioned into monochromatic Berge-paths of distinct colors. Also, apart from 2k − 5 vertices, 2-colored k-uniform hypergraphs can be partitioned into two monochromatic loose paths...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2012
ISSN: 1570-8667
DOI: 10.1016/j.jda.2011.12.009